A pr 2 01 5 PROOF THEORY OF A MULTI - LANE SPATIAL LOGIC
نویسنده
چکیده
We extend the Multi-lane Spatial Logic MLSL, introduced in previous work for proving the safety (collision freedom) of traffic maneuvers on a multi-lane highway, by length measurement and dynamic modalities. We investigate the proof theory of this extension, called EMLSL. To this end, we prove the undecidability of EMLSL but nevertheless present a sound proof system which allows for reasoning about the safety of traffic situations. We illustrate the latter by giving a formal proof for the reservation lemma we could only prove informally before. Furthermore we prove a basic theorem showing that the length measurement is independent from the number of lanes on the highway.
منابع مشابه
Proof Theory of a Multi-Lane Spatial Logic
We extend the Multi-lane Spatial Logic MLSL, introduced in previous work for proving the safety (collision freedom) of traffic maneuvers on a multi-lane highway, by length measurement and dynamic modalities. We investigate the proof theory of this extension, called EMLSL. To this end, we prove the undecidability of EMLSL but nevertheless present a sound proof system which allows for reasoning a...
متن کاملA pr 2 00 5 Modelling Linear Logic without Units ( Preliminary Results )
Proof nets for MLL, unit-free Multiplicative Linear Logic (Girard, 1987), provide elegant, abstract representations of proofs. Cut-free MLL proof nets form a category, under path composition, in the manner of EilenbergKelly-Mac Lane graphs (Eilenberg and Kelly, 1966; Kelly and Mac Lane, 1971). Objects are formulas of MLL, and a morphism A → B, a proof net from A to B, is a linking or matching b...
متن کاملUndecidability Results for Multi-Lane Spatial Logic
We consider (un)decidability of Multi-Lane Spatial Logic (MLSL), a multi-dimensional modal logic introduced for reasoning about traffic manoeuvres. MLSL with length measurement has been shown to be undecidable. However, the proof relies on exact values. This raises the question whether the logic remains undecidable when we consider robust satisfiability, i.e. when values are known only approxim...
متن کاملAn Abstract Model for Proving Safety of Multi-lane Traffic Manoeuvres
We present an approach to prove safety (collision freedom) of multi-lane motorway traffic with lane-change manoeuvres. This is ultimately a hybrid verification problem due to the continuous dynamics of the cars. We abstract from the dynamics by introducing a new spatial interval logic based on the view of each car. To guarantee safety, we present two variants of a lane-change controller, one wi...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کامل